package com.tgy.algorithm.base._二叉树;

public class _二叉树两个节点之间的最大距离 {

    public static BiTreeNode generalBiTreeNode() {
        /**
         *              1
         *         2           3
         *       4     5    6
         *                 7
         */
        BiTreeNode root = new BiTreeNode(1);
        root.left = new BiTreeNode(2);
        root.right = new BiTreeNode(3);
        root.left.left = new BiTreeNode(4);
        root.left.right = new BiTreeNode(5);
        root.right.left = new BiTreeNode(6);
        root.right.left.left = new BiTreeNode(7);
        return root;
    }

    public static void main(String[] args) {

    }
}
